Extending Unification Formalisms
نویسندگان
چکیده
This paper describes some of the results of the project The Reusability of Grammatical Resources. The aim of the project is to extend current grammar formalisms with notational devices and constraint solvers in order to aid the development of reusable grammars. The project took the Advanced Linguistic Engineering Platform (ALEP) as its starting point. ALEP allows two levels of extension: additional syntactic expressions (“syntactic sugar”) and specialised external constraint solvers. Our syntactic additions to ALEP comprise support for LFG coherence and completeness and an extended notation for phrase-structure rules. The project has developed solvers for set constraints, set operations, linear precedence constraints and guarded constraints. The extensions were formally specified and implemented as Prolog modules and hence have a wider applicability. These can be either used standalone or integrated within existing grammar formalisms. We have sucessfully integrated the all constraint solvers with the ProFIT typed feature system and these have been partially integrated into ALEP.
منابع مشابه
The Formal and Computational Theory of Constraint Logic Grammars
The framework presented in this chapter assumes that any grammar is a particular first order theory with equality. We will turn our attention to those first order theories admitting complete models and extend them to recursively defined relations. Logic programming is an ideal paradigm for such a framework in that it supports a direct mapping between grammars, seen as first order logic theories...
متن کاملThe Formal and Computational Theory of Complex Constraint Solution
The framework presented in this chapter assumes that any grammar is a particular first order theory with equality. We will turn our attention to those first order theories admitting complete models and extend them to recursively defined relations. Logic programming is an ideal paradigm for such a framework in that it supports a direct mapping between grammars, seen as first order logic theories...
متن کاملAssessing Complexity Results in Feature Theories
In this paper, we assess the complexity results of formalisms that describe the feature theories used in computational linguistics. We show that from these complexity results no immediate conclusions can be drawn about the complexity of the recognition problem of unification grammars using these feature theories. On the one hand, the complexity of feature theories does not provide an upper boun...
متن کاملFeature Structures and Nonmonotonicity
Unification-based grammar formalisms use feature structures to represent linguistic knowledge. The only operation defined on feature structures, unification, is information-combining and monotonic. Several authors have proposed nonmonotonic extensions of this formalism, as for a linguistically adequate description of certain natural language phenomena some kind of default reasoning seems essent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995